Emulating Round-to-Nearest Ties-to-Zero “Augmented” Floating-Point Operations Using Round-to-Nearest Ties-to-Even Arithmetic
نویسندگان
چکیده
The 2019 version of the IEEE 754 Standard for Floating-Point Arithmetic recommends that new “augmented” operations should be provided binary formats. These use a “rounding direction”: round-to-nearest ties-to-zero . We show how they can implemented using currently available operations, xmlns:xlink="http://www.w3.org/1999/xlink">ties-to-even with partial formal proof correctness.
منابع مشابه
Floating-Point Arithmetic on Round-to-Nearest Representations
Recently we introduced a class of number representations denoted RN-representations, allowing an un-biased rounding-to-nearest to take place by a simple truncation. In this paper we briefly review the binary fixed-point representation in an encoding which is essentially an ordinary 2’s complement representation with an appended round-bit. Not only is this rounding a constant time operation, so ...
متن کاملInterval operations in rounding to nearest
We give a simple and efficient method to simulate interval operations using only rounding to nearest in IEEE 754. The quality in terms of the diameter of the result is significantly improved compared to existing approaches.
متن کاملnon-corrective approach to pronunciation
the aim of this study has been to find answers for the following questions: 1. what is the effect of immediate correction on students pronunciation errors? 2. what would be the effect of teaching the more rgular patterns of english pronunciation? 3. is there any significant difference between the two methods of dealing with pronuciation errore, i. e., correction and the teaching of the regular ...
15 صفحه اولAutomated Seismic-to-well Ties?
SUMMARY The quality of seismic-to-well tie is commonly quantified using the classical Pearson's correlation coefficient. However the seismic wavelet is time-variant, well logging and upscaling is only approximate, and the correlation coefficient does not follow this nonlinear behavior. We introduce the Dynamic Time Warping (DTW) to automate the tying process, accounting for frequency and time v...
متن کاملRound-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poor round complexity when compiled for a point-to-point network due to the high overhead of emulating each invocation of broadcast. This problem is compounded when broadcast is used in more than one round of the origina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2021
ISSN: ['1557-9956', '2326-3814', '0018-9340']
DOI: https://doi.org/10.1109/tc.2020.3002702